dual simplex method
英 [ˈdjuːəl ˈsɪmpleks ˈmeθəd]
美 [ˈduːəl ˈsɪmpleks ˈmeθəd]
网络 对偶单纯形法; 对偶单形法
双语例句
- Lagrange dual problem of second-order cone programming and its 2-dimentional primal-dual simplex method
二阶锥规划的Lagrange对偶及2维原始对偶单纯形法 - Improvement on the Dual Simplex Method about Linear Programming
线性规划对偶单纯形算法的改进 - A Supplement to Dual Simplex Method
对偶单纯形法的一点补充 - The parameter uncertainty interval estimation ( PIE) problem was transferred into a set of dual linear programming ( DLP) problems, and an improved simplex method was proposed to solve these DLP problems.
将参数不定区间估计（PIE）问题变换成一组对偶线性规划（DLP）问题，提出了求解这组DLP问题的改进单纯形方法。 - Improved Dual Simplex Method for Linear Programming
线性规划一种改进的对偶单纯形法 - A Direct Dual Simplex Method for Linear Programming with Generalized Bounded Varibles
变量有广义界线性规划的直接对偶单纯形法 - Study on Simplex Method and Dual Simplex Method
探讨单纯形方法和对偶单纯形方法 - A Generalized Dual Simplex Method
广义对偶单纯形方法 - Commonsensible Economic Description of Dual Simplex Method for Linear Programming
线性规划对偶单纯形法的常识性经济解释 - Although linear programming problem is an ancient problem, the method of its solution is continuously developing. The methods to solve linear programming problem include the simplex method, dual simplex method, ellipsoid method as well as the interior-point method etc.
线性规划问题虽然是一个古老的问题，但求解线性规划问题的方法在不断发展：从单纯形方法、对偶单纯形方法、椭圆方法到内点方法等等。 - This paper discusses linear programming problems with generalized bounded variables. With the help of the technique of simplex method for standard constrained linear programming, a direct dual simplex method for the discussed problems is presented.
本文讨论变量有广义界线性规划问题借助标准形线性规划同单纯形法技术，建立问题的一个直接对偶单纯形法。 - A Phase-ⅰ Algorithm Using the Most-Obtuse-Angle Rule for the Basis-Deficiency-Allowing Dual Simplex Method
基于最钝角规则的亏基对偶单纯形Ⅰ阶段算法 - This method completes the theory system of dual simplex method.
这一方法使对偶单纯性方法这一理论体系得以完善。 - Compared with the dual simplex method, the amount of the storage and calculations of the improved algorithm is largely reduced.
与原对偶单纯形法相比，改进算法的存贮量和计算量大大减少。 - Based on the principle of the dual simplex method about linear programming, the changes of the value of the objective function in iterations have been studied.
运用求解线性规划对偶单纯形算法原理，进一步研究迭代过程中目标函数的变化。 - Commonly in additional to simplex method and dual simplex method, another original dual method can solve the liner programming.
解线性规划问题除常见的单纯形法和对偶单纯形法外，还有一种原始对偶法。 - The isotropic surfaces of both fce and bcc metals under plane stress were calculated by Taylor theory which was solved with the linear programming dual simplex method.
本文用对偶单形法线性规划求解Taylor理论，计算了面心立方和体心立方金属在平面应力条件下各向同性屈服表面。 - This paper gives the practicable simplex method and dual simplex method which can avoid circulating in the course of the computation.
给出了一种可以避免循环并且很实用的单纯形方法和对偶单纯形方法。 - Based on the improved algorithm for the primal simplex method, an improved algorithm of the dual simplex method for the linear programming with standard constraints are analyzed and presented.
根据改进原始单纯形法思想，建立了标准型线性规划对偶单纯形法的一种改进算法。 - Dual simplex method and/ or primal-dual simplex method need a dual feasible basis to get themselves started.
对偶单纯形算法或原始对偶单纯形算法都需要一个初始对偶可行基。 - Dual Simplex Method of Linear Programming with Bounded Variables
变量有上界的线性规划的对偶单纯形方法